Continuous Query Optimization

نویسندگان

  • Ron Avnur
  • Joseph M. Hellerstein
چکیده

In large federated and shared-nothing databases, resources can exhibit widely uctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are ine ective in these environments. In this paper we introduce a query processing mechanism called an eddy, which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers that require inputs from di erent sources to be coordinated. By combining eddies with join algorithms appropriate to large-scale environments, we merge the optimization and execution phases of query processing, allowing each tuple to have a exible ordering of the query operators. This exibility is controlled by a combination of uid dynamics and a simple learning algorithm. Our initial implementation demonstrates promising results, with eddies performing nearly as well as a static optimizer/executor in static scenarios, and adapting to run-time changes in the execution environment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Multiple Continuous Queries over RFID Streaming Data

RFID technology enables a new era of business optimization. With the development of RFID technology, more and more RFID applications have been developed. In RFID system, RFID middleware collects, filters, and integrates large volume of streaming data gathered continuously by heterogeneous readers to process queries from applications. These queries are called continuous queries as they are execu...

متن کامل

Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems

A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially installed for a continuous query may become inefficient. As a consequence, the query optimizer will re-optimize this plan based on the current statistics. The replacement of the running plan with a more efficient but semanti...

متن کامل

Dynamic Optimization and Migration of Continuous Queries Over Data Streams

Continuous queries process real-time streaming data and output results in streams for a wide range of applications. Due to the fluctuating stream characteristics, a streaming database system needs to dynamically adapt query execution. This dissertation proposes novel solutions to continuous query adaptation in three core areas, namely dynamic query optimization, dynamic plan migration and parti...

متن کامل

Optimization and Security of Continuous Anonymizing Data Stream

The characteristic of data stream is that it has a huge size and its data change continually, which needs to be responded quickly, since the times of query is limited. The continuous query and data stream approximate query model are introduced in this paper. Then, the query optimization of data stream and traditional database are compared such as k-anonymity methods, are designed for static dat...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

A Temporal Foundation for Continuous Queries over Data Streams

Despite the surge of research in continuous stream processing, there is still a semantical gap. In many cases, continuous queries are formulated in an enriched SQL-like query language without specifying the semantics of such a query precisely enough. To overcome this problem, we present a sound and precisely defined temporal operator algebra over data streams ensuring deterministic query result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999